Ergodic theory on stationary random graphs
نویسندگان
چکیده
A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random graphs of subexponential growth are almost surely Liouville, that is, admit no non constant bounded harmonic functions. Applications include the uniform infinite planar quadrangulation and long-range percolation clusters.
منابع مشابه
A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملRecords from Stationary Observations Subject to a Random Trend
We prove strong convergence and asymptotic normality for the record and the weak record rate of observations of the form Yn = Xn + Tn, n ≥ 1, where (Xn)n∈Z is a stationary ergodic sequence of random variables and (Tn)n≥1 is a stochastic trend process, with stationary ergodic increments. The strong convergence result follows from the Dubins-Freedman law of large numbers and Birkhoff’s ergodic th...
متن کاملNonsingular Group Actions and Stationary Sαs Random Fields
This paper deals with measurable stationary symmetric stable random fields indexed by Rd and their relationship with the ergodic theory of nonsingular Rd-actions. Based on the phenomenal work of Rosiński (2000), we establish extensions of some structure results of stationary SαS processes to SαS fields. Depending on the ergodic theoretical nature of the underlying action, we observe different b...
متن کاملRecurrence of cocycles and stationary random walks
We survey distributional properties of R-valued cocycles of finite measure preserving ergodic transformations (or, equivalently, of stationary random walks in R) which determine recurrence or transience. Let (Xn, n ≥ 0) be an ergodic stationary Rd-valued stochastic process, and let (Yn = X0 + · · · + Xn−1, n ≥ 1) be the associated random walk. What can one say about recurrence of this random wa...
متن کاملNonparametric Entropy Estimation for Stationary Processesand Random Fields, with Applications to English Text
We discuss a family of estimators for the entropy rate of a stationary ergodic process and prove their pointwise and mean consistency under a Doeblin-type mixing condition. The estimators are Cesàro averages of longest match-lengths, and their consistency follows from a generalized ergodic theorem due to Maker. We provide examples of their performance on English text, and we generalize our resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011